On the Castelnuovo-mumford Regularity of the Cohomology Ring of a Group
نویسندگان
چکیده
Dave Benson, in [2], conjectured that for any finite group G and any prime p the Castelnuovo-Mumford regularity of the cohomology ring, H(G,Fp), is zero. He showed that reg(H(G,Fp)) ≥ 0 and succeeded in proving equality when the difference between the dimension and the depth is at most two. The purpose of this paper is to prove Benson’s Regularity Conjecture as a corollary of the following result.
منابع مشابه
Castelnuovo-Mumford regularity of products of monomial ideals
Let $R=k[x_1,x_2,cdots, x_N]$ be a polynomial ring over a field $k$. We prove that for any positive integers $m, n$, $text{reg}(I^mJ^nK)leq mtext{reg}(I)+ntext{reg}(J)+text{reg}(K)$ if $I, J, Ksubseteq R$ are three monomial complete intersections ($I$, $J$, $K$ are not necessarily proper ideals of the polynomial ring $R$), and $I, J$ are of the form $(x_{i_1}^{a_1}, x_{i_2}^{a_2}, cdots, x_{i_l...
متن کاملAn upper bound for the regularity of powers of edge ideals
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
متن کاملMultigraded Castelnuovo-mumford Regularity
We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of multigraded regularity involves the vanishing of graded components of local cohomology. We establish the key properties of regularity: its connection with the m...
متن کاملTesting Benson’s Regularity Conjecture
D. J. Benson conjectures that the Castelnuovo-Mumford regularity of the cohomology ring of a finite group is always zero. More generally he conjectures that there is always a very strongly quasi-regular system of parameters. Computer calculations show that the second conjecture holds for all groups of order less than 256.
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کامل